Section: New Results

Formal study of probabilistic programs

Participants : Cécile Baritel-Ruet, Benjamin Grégoire, José Bacelar Almeida [INESC TEC] , Manuel Barbosa [INESC TEC] , Gilles Barthe [IMDEA] , Sonia Belaïd [CryptoExpert] , Matthew Campagna [AWS] , Gaëtan Cassiers [UCL] , Sunjay Cauligi [UC San Diego] , Ernie Cohen [AWS] , François Dupressoir [University of Surrey] , Pierre-Alain Fouque [Université Rennes 1] , Charlie Jacomme [LSV] , Steve Kremer [Inria Nancy Grand-Est, PESTO project Team] , Adrien Koutsos [LSV] , Vincent Laporte [Inria] , Tiago Oliveira [INESC TEC] , Vitor Pereira [INESC TEC] , Bernardo Portela [INESC TEC] , Alley Stoughton [Boston University] , François-Xavier Standaert [UCL] , Deian Stefan [UC San Diego] , Pierre-Yves Strub [Ecole Polytechnique] , Serdar Tasiran [AWS] .

We provide two differents tools:

• EasyCrypt (see http://www.easycrypt.info/) is a toolset for reasoning about relational properties of probabilistic computations with adversarial code. Its main application is the construction and verification of game-based cryptographic proofs.

• Jasmin (see https://github.com/jasmin-lang/jasmin) is certified compiler to generate high-speed and high-assurance cryptographic code.